Channel Assignment for Mobile Communications Using Stochastic Chaotic Simulated Annealing
نویسندگان
چکیده
The channel assignment problem (CAP), the task to assign the required number of channels to each radio cell in such a way that interference is precluded and the frequency spectrum is used efficiently, is known to be an NP-complete optimization problem. In this paper, we solve CAP using a stochastic chaotic neural network that we proposed recently. The performance of stochastic chaotic simulated annealing (SCSA) is compared with other algorithms in several benchmark CAPs. Simulation results showed that this approach is able to further improve on results obtained by other algorithms.
منابع مشابه
Reducing Interference in the Mobile Two-Tier Ad Hoc and Wireless Sensor Networks with the Help of Stochastic Chaotic Simulated Annealing
In this paper, a very efficient approach to reducing interference in mobile ad hoc and wireless sensor networks is proposed. The approach uses chaotic simulated annealing (CSA). The basic concept of this method was formulated as a channel assignment problem (CAP). The solution of the CAP problem is based here on neural networks which are able to find a conflictfree frequency assignment for the ...
متن کاملChannel assignment in cellular radio using genetic algorithms
The channel assignment problem has become increasingly important in mobile telephone communication. Since the usable range of the frequency spectrum is limited, the optimal assignment problem of channels has become increasingly important. Recently Genetic Algorithms (GAs) have been proposed as new computational tools for solving optimization problems. GAs are more attractive than other optimiza...
متن کاملChannel Allocation in Wireless Communication using Genetic Algorithm
The demand for mobile communication has been steadily increasing in recent years. With the limited frequency spectrum, the problem of channel assignment becomes increasingly important, i.e., how do we assign the calls to the available channels so that the interference is minimized while the demand is met? This problem is known to belong to a class of very difficult combinatorial optimization pr...
متن کاملGlobal Search Techniques for Problems in Mobile Communications
In the late 70's and the 80's global search techniques such as Genetic Algorithms (GA's), Simulated Annealing (SA), and Tabu Search (TS) were developed. These procedures are all adaptive, iterative, randomized heuristic searches that are guaranteed to locate the global optimum even in NP-hard combinatorial optimization problems. At about the same time, mobile radio communication systems (such a...
متن کاملSolving Combinatorial Optimization Problems Using Stochastic Chaotic Simulated Annealing
Chen and Aihara have showed recently that their chaotic simulated annealing (CSA) has better search ability for solving combinatorial optimization problems compared to both the Hopfield-Tank approach and stochastic simulated annealing (SSA). However, CSA is not guaranteed to find a globally optimal solution no matter how slowly annealing is carried out. In contrast, SSA is guaranteed to settle ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001